Arithmetic circuits: The chasm at depth four gets wider
نویسنده
چکیده
In their paper on the “chasm at depth four”, Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which admit arithmetic circuits of size 2 also admit arithmetic circuits of depth four and size 2. This theorem shows that for problems such as arithmetic circuit lower bounds or black-box derandomization of identity testing, the case of depth four circuits is in a certain sense
منابع مشابه
A Note on Depth Reduction: A Simple Proof of the Chasm
Agrawal and Vinay [AV08] showed how any subexponential arithmetic circuit can be thought of as a depth four subexponential arithmetic circuit. This unexpected depth reduction to constant depth is in contrast to curcuits in the Boolean setting. The resulting circuit size in this simulation was more carefully analyzed by Korian [Koi12] and subsequently by Tavenas [Tav13]. We provide a simple proo...
متن کاملThe Chasm at Depth Four, and Tensor Rank : Old results, new insights
Agrawal and Vinay [AV08] showed how any polynomial size arithmetic circuit can be thought of as a depth four arithmetic circuit of subexponential size. The resulting circuit size in this simulation was more carefully analyzed by Korian [Koi12] and subsequently by Tavenas [Tav15]. We provide a simple proof of this chain of results. We then abstract the main ingredient to apply it to formulas and...
متن کاملArithmetic circuits: A chasm at depth three four
We show that, over Q, if an n-variate polynomial of degree d = nO(1) is computable by an arithmetic circuit of size s (respectively by an algebraic branching program of size s) then it can also be computed by a depth three circuit (i.e. a ΣΠΣ-circuit) of size exp(O( √ d log d log n log s)) (respectively of size exp(O( √ d log n log s))). In particular this yields a ΣΠΣ circuit of size exp(O( √ ...
متن کاملAn exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin
Agrawal and Vinay [AV08] have recently shown that an exponential lower bound for depth four homogeneous circuits with bottom layer of × gates having sublinear fanin translates to an exponential lower bound for a general arithmetic circuit computing the permanent. Motivated by this, we examine the complexity of computing the permanent and determinant via homogeneous depth four circuits with boun...
متن کاملApproximate Degree and the Complexity of Depth Three Circuits
Threshold weight, margin complexity, and Majority-of-Threshold circuit size are basic complexity measures of Boolean functions that arise in learning theory, communication complexity, and circuit complexity. Each of these measures might exhibit a chasm at depth three: namely, all polynomial size Boolean circuits of depth two have polynomial complexity under the measure, but there may exist Bool...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 448 شماره
صفحات -
تاریخ انتشار 2012